An Analysis of Some Heuristics forthe Maximum Planar
نویسنده
چکیده
We analyze several heuristics for nding a maximum planar subgraph of a nonplanar graph. The problem is NP-hard, although heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively , with an incremental method, a \cycle packing" approach, and a branch-and-cut algorithm. For the incre-mental method, the path addition method, and an edge addition method, we prove theoretical worst-case performance bounds of 1=3. We also present an empirical analysis of some of the heuristics. Our results indicate that the branch-and-cut method yields the best solutions.
منابع مشابه
Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem
We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs*
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple randomized optimizers on the maximum clique problem on planar graphs is investigated rigorously. The focus is on the worst-, average-, and semi-average-case behaviors. In semi-random planar graph models an adversary i...
متن کاملDamage Assessment using an Inverse Fracture Mechanics approach
This paper studies the application of an inverse methodology for problem solving in fracture mechanics using the finite element analysis. The method was applied to both detection of subsurface cracks and the study of propagating cracks. The procedure for detection of subsurface cracks uses a first order optimization analysis coupled with a penalty function to solve for the unknown geometric par...
متن کاملAn Analysis of Heuristics for Graph
We analyze several heuristics for graph planarization, i.e., deleting the minimum number of edges from a nonplanar graph to make it planar. The problem is NP-hard, although some heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively, with a selective edge addition method, an incr...
متن کاملTraveling Waves of Some Symmetric Planar Flows of Non-Newtonian Fluids
We present some variants of Burgers-type equations for incompressible and isothermal planar flow of viscous non-Newtonian fluids based on the Cross, the Carreau and the power-law rheology models, and on a symmetry assumption on the flow. We numerically solve the associated traveling wave equations by using industrial data and in order to validate the models we prove existence and uniqueness of ...
متن کامل